基于ARMA模型的双路径差异性分析

拟通过单向时延的历史记录对其未来趋势进行预测。首先,通过粗粒度和细粒度两种方式采集世界各地若干目标节点的单向时延作为原始数据;然后,结合多种预测模型的特点和原始数据的内在属性,提出一种基于ARMA模型的双路径差异性分析方法;最后选取合理的预测窗口对方法的准确性进行验证。结果表明,该预测方法是正确、合理的,与灰色预测模型相比能更有效地预测单项时延差序列。     

Comprehensive performance evaluation of distributed and dynamic mobility routing strategy

In this paper, we conduct a comprehensive performance study of distributed and dynamic mobility management (DDMM). DDMM presents a new architectural paradigm for a sustainable mobile networking against an ever-increasing amount of Internet data traffic, providing IP mobility management with distributed deployment of mobility anchors and dynamic activation when mobility is needed. Such a distributed mobility management concept is generally and intuitively accepted in terms of effective distribution of mobile traffic when compared with centralized mobility management (CMM) approaches. Nevertheless, the routing strategy of DDMM has not yet been properly examined through performance studies, and especially the impact of potential mobility routing strategies on the user plane is an open question. We perform a mathematical analysis of DDMM and present numerical results aiming to identify in which conditions, by which factors, and how much, DDMM improves mobility performance. For comparison, Mobile IPv6, Proxy Mobile IPv6 (PMIPv6), and PMIPv6 localized routing (PMIPv6-LR) were considered as representative IP mobility protocols following CMM approaches. Analytical results demonstrate that DDMM generally achieves higher performance when compared with CMM-based protocols in terms of packet delivery cost, tunneling overhead, and throughput, but specific performance varies in function of multiple input parameters.     

A resilient buffer allocation scheme in active queue management: a stochastic cooperative game theoretic approach

During the last decade, a plentiful number of active queue management schemes have been proposed, but their main objectives are simply allocating the buffer resource to all flows evenly, or protecting responsive flows from being degraded by unresponsive flows. However, the sending rates of the responsive flows can be determined diversely, and not all unresponsive flows have aggressively high sending rates. Furthermore, it is rational to reserve a portion of the buffer resource for certain privileged traffic. Grounded by these evidences, in this paper, we present a resilient active queue management algorithm, named Prior‐Core‐based Buffer Allocation considering diverse congestion control algorithms, fair‐unresponsive flows, and some privileged traffic. Our approach is based on stochastic cooperative game theory, where the payoffs yielded by cooperation are described by random variables, and the core is defined only over the distribution of these random payoffs; the core in this situation is called the prior‐core. As a result, it is shown that our buffer allocation, yielded by the prior‐core, achieves completely fair allocation for those flows whose requirement does not exceed the fair‐share regardless of the responsiveness, whereas aggressive flows are restricted according to availability of the buffer; all these are verified through ns‐2 simulation experiments. Copyright © 2014 John Wiley & Sons, Ltd.     

基于三维胞元空间的MA双向并行路由算法

针对传统移动代理(MA)在监测无线传感器网络(WSNs)的感兴趣信息时产生的延迟较大和能耗较多问题,提出了基于三维胞元空间的MA双向并行(3D-BPMA)路由算法.3D-BPMA将MA与传统的客户/服务器(c/S)模式相结合,在胞元内利用C/S模式搜集信息,在单层胞元系统和路由器与路由器之间采用MA双向并行的策略进行传输.仿真结果表明:3D-BPMA与LCF,DSG-MIP算法相比减少了平均响应时间和网络平均能耗,提高了MA发送率.     

Testing local search move operators on the vehicle routing problem with split deliveries and time windows

The vehicle routing problem (VRP) is an important transportation problem. The literature addresses several extensions of this problem, including variants having delivery time windows associated with customers and variants allowing split deliveries to customers. The problem extension including both of these variations has received less attention in the literature. This research effort sheds further light on this problem. Specifically, this paper analyzes the effects of combinations of local search (LS) move operators commonly used on the VRP and its variants. We find when paired with a MAX-MIN Ant System constructive heuristic, Or-opt or 2-opt⁎ appear to be the ideal LS operators to employ on the VRP with split deliveries and time windows with Or-opt finding higher quality solutions and 2-opt⁎ requiring less run time.     

Customer satisfaction in dynamic vehicle routing problem with time windows

The dynamic vehicle routing and scheduling problem is a well-known complex combinatorial optimization problem that drew significant attention over the past few years. This paper presents a novel algorithm introducing a new strategy to integrate anticipated future visit requests during plan generation, aimed at explicitly improving customer satisfaction. An evaluation of the proposed strategy is performed using a hybrid genetic algorithm previously designed for the dynamic vehicle problem with time windows that we modified to capture customer satisfaction over multiple visits. Simulations compare the value of the revisited algorithm exploiting the new strategy, clearly demonstrating its impact on customer satisfaction level.     

Heuristic algorithms for a three-dimensional loading capacitated vehicle routing problem in a carrier

In this paper, we present heuristic algorithms for a three-dimensional loading capacitated vehicle routing problem arising in a real-world situation. In this problem, customers make requests of goods, which are packed in a sortment of boxes. The objective is to find minimum cost delivery routes for a set of identical vehicles that, departing from a depot, visit all customers only once and return to the depot. Apart of the usual 3D container loading constraints which ensure that the boxes are packed completely inside the vehicles and that the boxes do not overlap each other in each vehicle, the problem also takes into account constraints related to the vertical stability of the cargo and multi-drop situations. The algorithms are based on the combination of classical heuristics from both vehicle routing and container loading literatures, as well as two metaheuristic strategies, and their use in more elaborate procedures. Although these approaches cannot assure optimal solutions for the respective problems, they are relatively simple, fast enough to solve real instances, flexible enough to include other practical considerations, and normally assure relatively good solutions in acceptable computational times in practice. The approaches are also sufficiently generic to be embedded with algorithms other than those considered in this study, as well as they can be easily adapted to consider other practical constraints, such as the load bearing strength of the boxes, time windows and pickups and deliveries. Computational tests were performed with these methods considering instances based on the vehicle routing literature and actual customers’ orders, as well as instances based on a real-world situation of a Brazilian carrier. The results show that the heuristics are able to produce relatively good solutions for real instances with hundreds of customers and thousands of boxes.     

Nash equilibrium cooperative transmission strategy considering competition

In cooperative communications, employing the idle relay node for forwarding data can effectively improve the transmission rate and performance of the wireless networks. Therefore, various relay node selection algorithms are proposed. However, most of the existing algorithms just focus on the benefit caused by relay nodes, while ignoring the negative effect of the backoff duration time which does not exist in direct transmission, when more than one flow compete for the same relay node. To this end, considering both advantage and adverse impact caused by the relay node, we adopt the game-theoretic approach and propose a cooperative transmission strategy based on the Nash equilibrium, named the Nash Equilibrium Cooperative Transmission Strategy (NECTS). The NECTS can not only guarantee the gain of each flow, but also maximize the system performance, and improve the system throughput effectively. Simulation results show that the NECTS can take the advantage of cooperative communications. Meanwhile, it can avoid the unnecessary competition, and its performance outperforms that of the existing methods.     

An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries

The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time.     

QoS-Aware Power Allocation Scheme for Relay Satellite Networks

This paper investigated a QoS-aware power allocation for relay satellite networks. For the given QoS requirements, we analyzed the signal model of relay transmission and formulated the power minimization problem which is non-convex and difficult to solve. To find the optimal solution to the considered problem, we first analyzed the optimization problem and equivalently turn it into a convex optimization problem. Then, we provided a Lagrangian dual-based method to obtain the closed-form of the power allocation and provided an iterative algorithm to the optimal solution.Moreover, we also extended the results to the cooperative transmission mode. Finally, simulation results were provided to verify the superiority of the proposed algorithm.